//二分查找 肖恩的乘法表
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 5e5+9;
ll n=0,m=0,k=0;

bool isgreater(ll mid)
{
	ll sum = 0;
	for(int i = 1; i <= n; i++)
	{
		sum += min(m,mid/i);
	}
	if(sum >= k)
		return true;
	else
		return false;
}
int main()
{
	cin >> n >> m >> k;
	ll l = 1;
	ll r = 1e12;
	while(l+1 != r)
	{
		ll mid = (l+r)/2;
		if(isgreater(mid))
			r = mid;
		else l = mid;
	}
	cout << r;
	return 0;
}
